منابع مشابه
A Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملA Note on Complementarity Problem
In this paper we prove a result of complementarity problem where compact condition is somewhat relaxed.
متن کاملA Note on the Two Cardinal Problem
In this note we prove a theorem concerning the two cardinal problem (see [l], [4], [6], [7] for reference and for some of the standard notation); this result has been referred to in [6, p. 311] and [7, (3.7) ]. The problem, first proposed by Vaught, is as follows. Let T be a first-order theory and let U be a unary predicate symbol in the language of T. T is said to admit the pair a, ß of cardin...
متن کاملA note on the ring loading problem
The Ring Loading Problem is an optimal routing problem arising in the planning of optical communication networks which use bidirectional SONET rings. In mathematical terms, it is an unsplittable multicommodity flow problem on undirected ring networks. We prove that any split routing solution to the Ring Loading Problem can be turned into an unsplittable solution while increasing the load on any...
متن کاملA note on the problem of heaps
SUMMARY. The model for the so-called " heaps " problem as set in Kingman (1975) is considered and an explicit expression for evaluating the expectation of the mean search time of a demanded item in equilibrium is provided. Particular attention is devoted to the γ-stable case and Kingman's results are recovered in the limit.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1969
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1969-0236371-1